A note on the security of MST 3 Maŕıa Isabel
نویسنده
چکیده
In this paper, we study the recently proposed encryption scheme MST3, focusing on a concrete instantiation using Suzuki-2-groups. In a passive scenario, we argue that the one wayness of this scheme may not, as claimed, be proven without the assumption that factoring group elements with respect to random covers for a subset of the group is hard. As a result, we conclude that for the proposed Suzuki 2-groups instantiation, impractical key sizes should be used in order to prevent more or less straightforward factorization attacks.
منابع مشابه
A note on the security of two improved RFID protocols
Recently, Baghery et al. [1, 2] presented some attacks on two RFID protocols, namely Yoon and Jung et al. protocols, and proposed the improved version of them. However, in this note, we show that the improved version of the Jung et al. protocol suffers from desynchronization attack and the improved version of the Yoon's protocol suffers from secret disclosure attack. The succe...
متن کاملSynthesis and Characterization of Porcelain Body Developed from Rice Husk Ash (TECHNICAL NOTE)
For a developing country like Bangladesh, waste management is an important issue. Since it is a small over-populated country , strict government regulations regarding landfills is essential. Expansion of ceramic industries is considered to be one of the potential sectors for the economic growth of Bangladesh. However, raw material cost per unit production is the prime concern for industrialists...
متن کاملMapping CRC Card into Stochastic Petri Net for Analyzing and Evaluating Quality Parameter of Security (TECHNICAL NOTE)
CRC cards are unconventional method for identifying and describing classes, behavior and its responsibilities and collaborators of class. Representation of three categories of class, responsibilities and collaborators can give proper image of scenario. These cards are effective method for analyzing scenarios. With all positive features of CRC cards, of weaknesses of these cards are failure to s...
متن کاملA note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
We give a tight analysis of the MST heuristic recently introduced by G.-H. Lin and G. Xue for approximating the Steiner tree with minimum number of Steiner points and bounded edge-lengths. The approximation factor of the heuristic is shown to be one less than the MST number of the underlying space, de ned as the maximum possible degree of a minimum-degree MST spanning points from the space. In ...
متن کاملComments on “Image encryption with chaotically coupled chaotic maps”
This paper studies the security of a recently proposed chaos-based cryptosystem. It is shown that the encryption architecture of this cryptosystem possesses some important problems related to its implementation and its robustness against noise. Some security problems are also highlighted.
متن کامل